Adaptive control for the PVTOL system via Minimum Projection Method
نویسندگان
چکیده
منابع مشابه
Control of a Hyperchaotic System Via Generalized Backstepping Method
This paper investigates on control and stabilization of a new hyperchaotic system. The hyperchaotic system is stabilized using a new technique which called Generalized Backstepping Method (GBM). Because of its similarity to Backstepping approach, this method is called GBM. But, this method is more applicable in comparison with conventional Backstepping. Backstepping method is used only for sy...
متن کاملفرآیند کنترل در سیستم کامپیوتری تهویه مطبوع airwasher environmental control system for intelligent buildings
در این پایان نامه با استفاده از تکنولوژی روز و امکانات داخل کشور طریقه اتوماسیون سیستم تاسیساتی یک کارخانه نساجی (کارخانه نساجی اطلس پود) همراه با منوهای مربوطه و توضیحات کامل برنامه نویسی و طراحی بلوک های برنامه و سایر قسمتهای برنامه ارائه گشته است. علاوه بر این، برنامه با نمونه آمریکایی آن مقایسه و مزیت های آن نسبت به آمریکایی توضیح داده شده است. همچنین تمامی بلوک های برنامه بصورت شماتیکی بطو...
15 صفحه اولAdaptive Tracking Control via Extremum-seeking Method
In this paper, an adaptive tracking controller is proposed using Extremum-seeking strategy. For unknown disturbances satisfying matching condition, the controller can adaptively seek for a proper magnitude level large enough for disturbance rejection without excessive control efforts. The proposed control strategy is robust to disturbances and uncertainties and is continuous in nature. As a res...
متن کاملReal-time Obstacle Avoidance of a Two-wheeled Mobile Robot via the Minimum Projection Method
This paper considers real-time obstacle avoidance control of a two-wheeled nonholonomic mobile robot. In this paper, we propose a discontinuous asymptotic stabilizing state feedback control law for a real-time obstacle avoidance problem via the minimum projection method. The method guarantees asymptotic stability and reduces the computational cost. The effectiveness of the proposed method is co...
متن کاملApproximating the minimum rank of a graph via alternating projection
The minimum rank problem asks to find the minimum rank over all matrices with given pattern associated with a graph. This problem is NP-hard, and there is no known approximation method. In this article, a numerical algorithm is given to heuristically approximate the minimum rank using alternating projections. The effectiveness of this algorithm is demonstrated by comparing its results to a rela...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2015
ISSN: 2405-8963
DOI: 10.1016/j.ifacol.2015.09.186